0.11/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.33	% Computer   : n014.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 14:20:04 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.33	% Number of cores: 8
0.12/0.33	% Python version: Python 3.6.8
0.12/0.34	# Version: 2.6rc1-ho
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 59 seconds
59.13/59.34	# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_S5PRR_SE_Q4_CS_SP_S4S
59.13/59.34	# and selection function SelectNewComplexAHPNS.
59.13/59.34	#
59.13/59.34	# Preprocessing time       : 0.029 s
59.13/59.34	# No success with AutoSched0
59.13/59.34	# Trying AutoSched1 for 26 seconds
59.18/59.40	# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
59.18/59.40	# and selection function PSelectComplexExceptUniqMaxHorn.
59.18/59.40	#
59.18/59.40	# Preprocessing time       : 0.029 s
59.18/59.40	# Presaturation interreduction done
59.18/59.40	
59.18/59.40	# Proof found!
59.18/59.40	# SZS status Theorem
59.18/59.40	# SZS output start CNFRefutation
59.18/59.40	thf(setminusI, conjecture, (dsetconstrI=>![X1:$i, X5:$i, X3:$i]:(in @ X3 @ X1=>(~(in @ X3 @ X5)=>in @ X3 @ (setminus @ X1 @ X5)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminusI)).
59.18/59.40	thf(dsetconstrI, axiom, (dsetconstrI<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ X1=>(X2 @ X3=>in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrI)).
59.18/59.40	thf(setminus, axiom, (setminus)=(^[X1:$i, X5:$i]:dsetconstr @ X1 @ (^[X3:$i]:~(in @ X3 @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setminus)).
59.18/59.40	thf(c_0_3, plain, ![X4:$i, X2:$i > $o]:(epred2_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)).
59.18/59.40	thf(c_0_4, plain, ![X12:$i, X5:$i]:(epred1_2 @ X5 @ X12<=>~in @ X12 @ X5), inference(fof_simplification,[status(thm)],[introduced(definition)])).
59.18/59.40	thf(c_0_5, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ X1=>(X2 @ X3=>in @ X3 @ (dsetconstr @ X1 @ (epred2_2 @ X2))))=>![X1:$i, X5:$i, X3:$i]:(in @ X3 @ X1=>(~in @ X3 @ X5=>in @ X3 @ (setminus @ X1 @ X5))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setminusI]), dsetconstrI]), c_0_3])])).
59.18/59.40	thf(c_0_6, plain, ![X1:$i, X5:$i]:(setminus @ X1 @ X5)=(dsetconstr @ X1 @ (epred1_2 @ X5)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[setminus]), c_0_4])).
59.18/59.40	thf(c_0_7, negated_conjecture, ![X15:$i, X16:$i > $o, X17:$i]:((~in @ X17 @ X15|(~X16 @ X17|in @ X17 @ (dsetconstr @ X15 @ (epred2_2 @ X16))))&(in @ esk3_0 @ esk1_0&(~in @ esk3_0 @ esk2_0&~in @ esk3_0 @ (setminus @ esk1_0 @ esk2_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
59.18/59.40	thf(c_0_8, plain, ![X13:$i, X14:$i]:(setminus @ X13 @ X14)=(dsetconstr @ X13 @ (epred1_2 @ X14)), inference(variable_rename,[status(thm)],[c_0_6])).
59.18/59.40	thf(c_0_9, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(in @ X1 @ (dsetconstr @ X3 @ (epred2_2 @ X2))|~in @ X1 @ X3|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_7])).
59.18/59.40	thf(c_0_10, plain, ![X1:$i, X3:$i]:(setminus @ X1 @ X3)=(dsetconstr @ X1 @ (epred1_2 @ X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
59.18/59.40	thf(c_0_11, plain, ![X4:$i, X3:$i, X2:$i > $o, X1:$i]:(in @ X1 @ (setminus @ X3 @ X4)|(epred1_2 @ X4)!=(epred2_2 @ X2)|~in @ X1 @ X3|~X2 @ X1), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_9, c_0_10])])).
59.18/59.40	thf(c_0_12, negated_conjecture, in @ esk3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_7])).
59.18/59.40	thf(c_0_13, plain, ![X21:$i, X22:$i]:((~epred1_2 @ X22 @ X21|~in @ X21 @ X22)&(in @ X21 @ X22|epred1_2 @ X22 @ X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])).
59.18/59.40	thf(c_0_14, negated_conjecture, ![X1:$i, X2:$i > $o]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|(epred1_2 @ X1)!=(epred2_2 @ X2)|~X2 @ esk3_0), inference(spm,[status(thm)],[c_0_11, c_0_12])).
59.18/59.40	thf(c_0_15, plain, ![X3:$i, X1:$i]:(in @ X1 @ X3|epred1_2 @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
59.18/59.40	thf(c_0_16, plain, ![X1:$i, X3:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ esk3_0 @ X3|(epred1_2 @ X1)!=(epred2_2 @ (epred1_2 @ X3))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
59.18/59.40	thf(c_0_17, plain, ![X3:$i, X1:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ esk3_0 @ X3|(epred1_2 @ X1 @ (esk7_2 @ X3 @ X1))!=(epred2_2 @ (epred1_2 @ X3) @ (esk7_2 @ X3 @ X1))), inference(neg_ext,[status(thm)],[c_0_16])).
59.18/59.40	thf(c_0_18, plain, ![X23:$i, X24:$i > $o]:((~epred2_2 @ X24 @ X23|X24 @ X23)&(~X24 @ X23|epred2_2 @ X24 @ X23)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])).
59.18/59.40	thf(c_0_19, plain, ![X3:$i, X1:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ esk3_0 @ X3|~epred2_2 @ (epred1_2 @ X3) @ (esk7_2 @ X3 @ X1)|~epred1_2 @ X1 @ (esk7_2 @ X3 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_17])).
59.18/59.40	thf(c_0_20, plain, ![X2:$i > $o, X1:$i]:(epred2_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_18])).
59.18/59.40	thf(c_0_21, plain, ![X3:$i, X1:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ esk3_0 @ X3|~epred1_2 @ X1 @ (esk7_2 @ X3 @ X1)|~epred1_2 @ X3 @ (esk7_2 @ X3 @ X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
59.18/59.40	thf(c_0_22, plain, ![X3:$i, X1:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ (esk7_2 @ X3 @ X1) @ X1|in @ esk3_0 @ X3|~epred1_2 @ X3 @ (esk7_2 @ X3 @ X1)), inference(spm,[status(thm)],[c_0_21, c_0_15])).
59.18/59.40	thf(c_0_23, negated_conjecture, ~in @ esk3_0 @ (setminus @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
59.18/59.40	thf(c_0_24, plain, ![X1:$i, X3:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|in @ (esk7_2 @ X3 @ X1) @ X3|in @ (esk7_2 @ X3 @ X1) @ X1|in @ esk3_0 @ X3), inference(spm,[status(thm)],[c_0_22, c_0_15])).
59.18/59.40	thf(c_0_25, plain, ![X3:$i, X1:$i]:(~epred1_2 @ X1 @ X3|~in @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
59.18/59.40	thf(c_0_26, plain, ![X1:$i, X3:$i]:(in @ esk3_0 @ (setminus @ esk1_0 @ X1)|epred2_2 @ (epred1_2 @ X3) @ (esk7_2 @ X3 @ X1)|epred1_2 @ X1 @ (esk7_2 @ X3 @ X1)|in @ esk3_0 @ X3), inference(dynamic cnf,[status(thm)],[c_0_17])).
59.18/59.40	thf(c_0_27, negated_conjecture, ![X1:$i]:(in @ (esk7_2 @ X1 @ esk2_0) @ esk2_0|in @ (esk7_2 @ X1 @ esk2_0) @ X1|in @ esk3_0 @ X1), inference(spm,[status(thm)],[c_0_23, c_0_24])).
59.18/59.40	thf(c_0_28, negated_conjecture, ~in @ esk3_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_7])).
59.18/59.40	thf(c_0_29, plain, ![X1:$i, X3:$i]:(epred2_2 @ (epred1_2 @ X1) @ (esk7_2 @ X1 @ X3)|in @ esk3_0 @ (setminus @ esk1_0 @ X3)|in @ esk3_0 @ X1|~in @ (esk7_2 @ X1 @ X3) @ X3), inference(spm,[status(thm)],[c_0_25, c_0_26])).
59.18/59.40	thf(c_0_30, negated_conjecture, in @ (esk7_2 @ esk2_0 @ esk2_0) @ esk2_0, inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_27]), c_0_28])).
59.18/59.40	thf(c_0_31, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred2_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_18])).
59.18/59.40	thf(c_0_32, plain, epred2_2 @ (epred1_2 @ esk2_0) @ (esk7_2 @ esk2_0 @ esk2_0), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_23]), c_0_28])).
59.18/59.40	thf(c_0_33, plain, epred1_2 @ esk2_0 @ (esk7_2 @ esk2_0 @ esk2_0), inference(spm,[status(thm)],[c_0_31, c_0_32])).
59.18/59.40	thf(c_0_34, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_33]), c_0_30])]), ['proof']).
59.18/59.40	# SZS output end CNFRefutation
59.18/59.40	# Proof object total steps             : 35
59.18/59.40	# Proof object clause steps            : 24
59.18/59.40	# Proof object formula steps           : 11
59.18/59.40	# Proof object conjectures             : 10
59.18/59.40	# Proof object clause conjectures      : 7
59.18/59.40	# Proof object formula conjectures     : 3
59.18/59.40	# Proof object initial clauses used    : 9
59.18/59.40	# Proof object initial formulas used   : 3
59.18/59.40	# Proof object generating inferences   : 11
59.18/59.40	# Proof object simplifying inferences  : 6
59.18/59.40	# Training examples: 0 positive, 0 negative
59.18/59.40	# Parsed axioms                        : 7
59.18/59.40	# Removed by relevancy pruning/SinE    : 0
59.18/59.40	# Initial clauses                      : 13
59.18/59.40	# Removed in clause preprocessing      : 4
59.18/59.40	# Initial clauses in saturation        : 9
59.18/59.40	# Processed clauses                    : 111
59.18/59.40	# ...of these trivial                  : 1
59.18/59.40	# ...subsumed                          : 7
59.18/59.40	# ...remaining for further processing  : 103
59.18/59.40	# Other redundant clauses eliminated   : 1
59.18/59.40	# Clauses deleted for lack of memory   : 0
59.18/59.40	# Backward-subsumed                    : 0
59.18/59.40	# Backward-rewritten                   : 0
59.18/59.40	# Generated clauses                    : 188
59.18/59.40	# ...of the previous two non-trivial   : 176
59.18/59.40	# Contextual simplify-reflections      : 0
59.18/59.40	# Paramodulations                      : 142
59.18/59.40	# Factorizations                       : 12
59.18/59.40	# NegExts                              : 12
59.18/59.40	# Equation resolutions                 : 1
59.18/59.40	# Propositional unsat checks           : 0
59.18/59.40	#    Propositional check models        : 0
59.18/59.40	#    Propositional check unsatisfiable : 0
59.18/59.40	#    Propositional clauses             : 0
59.18/59.40	#    Propositional clauses after purity: 0
59.18/59.40	#    Propositional unsat core size     : 0
59.18/59.40	#    Propositional preprocessing time  : 0.000
59.18/59.40	#    Propositional encoding time       : 0.000
59.18/59.40	#    Propositional solver time         : 0.000
59.18/59.40	#    Success case prop preproc time    : 0.000
59.18/59.40	#    Success case prop encoding time   : 0.000
59.18/59.40	#    Success case prop solver time     : 0.000
59.18/59.40	# Current number of processed clauses  : 85
59.18/59.40	#    Positive orientable unit clauses  : 5
59.18/59.40	#    Positive unorientable unit clauses: 0
59.18/59.40	#    Negative unit clauses             : 2
59.18/59.40	#    Non-unit-clauses                  : 78
59.18/59.40	# Current number of unprocessed clauses: 83
59.18/59.40	# ...number of literals in the above   : 436
59.18/59.40	# Current number of archived formulas  : 0
59.18/59.40	# Current number of archived clauses   : 18
59.18/59.40	# Clause-clause subsumption calls (NU) : 2974
59.18/59.40	# Rec. Clause-clause subsumption calls : 670
59.18/59.40	# Non-unit clause-clause subsumptions  : 7
59.18/59.40	# Unit Clause-clause subsumption calls : 118
59.18/59.40	# Rewrite failures with RHS unbound    : 0
59.18/59.40	# BW rewrite match attempts            : 0
59.18/59.40	# BW rewrite match successes           : 0
59.18/59.40	# Condensation attempts                : 0
59.18/59.40	# Condensation successes               : 0
59.18/59.40	# Termbank termtop insertions          : 16515
59.18/59.40	
59.18/59.40	# -------------------------------------------------
59.18/59.40	# User time                : 58.991 s
59.18/59.40	# System time              : 0.071 s
59.18/59.40	# Total time               : 59.062 s
59.18/59.40	# Maximum resident set size: 1636 pages
59.18/59.40	EOF